Multi-Robot Energy-Efficient Coverage Control with Hopfield Networks
نویسندگان
چکیده
منابع مشابه
Improving Energy-Efficient Target Coverage in Visual Sensor Networks
Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...
متن کاملimproving energy-efficient target coverage in visual sensor networks
target coverage is one of the important problems in visual sensor networks. the coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. in this paper, we address the maximum lifetime for visual sensor networks (mlv) problem by maximizing the network lifetime while covering all the targets. for this purpose, we develop a simulated annealing (sa) ...
متن کاملCoverage control by multi-robot networks with limited-range anisotropic sensory
This paper considers the deployment of a network of robotic agents with limited-range communication and anisotropic sensing capabilities. We encode the environment coverage provided by the network by means of an expected-value objective function. This function has a gradient which is not amenable to distributed computation. We provide a constant-factor approximation of this measure via an alter...
متن کاملEnergy Efficient Area Coverage for an Autonomous Demining Robot
This work studies different coverage approaches with a mobile robot equipped with a landmine detecting sensor attached to an actuator arm. Different coverage techniques were experiment in this work and the cost benefit was analyzed in terms of energy consumption. The problem of optimising the combined motion of a mobile platform with an arm was addressed. The feasibility and effectiveness of bo...
متن کاملMulti-Robot Adversarial Coverage
This work discusses the problem of adversarial coverage, in which one or more robots are required to visit every point of a given area, which contains threats that might stop the robots. The objective of the robots is to cover the target area as quickly as possible, while maximizing the percentage of covered area before they are stopped. This problem has many real-world applications, from perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studies in Informatics and Control
سال: 2020
ISSN: 1220-1766,1841-429X
DOI: 10.24846/v29i2y202004